Cooperating Techniques for Solving Nonlinear Real Arithmetic in the cvc5 SMT Solver (System Description)
نویسندگان
چکیده
Abstract The SMT solver solves quantifier-free nonlinear real arithmetic problems by combining the cylindrical algebraic coverings method with incremental linearization in an abstraction-refinement loop. result is a complete decision procedure that leverages efficient heuristics for refining candidate models. Furthermore, it can be used quantifiers, integer variables, and combination other theories. We describe overall framework, individual solving techniques, number of implementation details. demonstrate its effectiveness evaluation on SMT-LIB benchmarks.
منابع مشابه
SMT-Based Constraint Answer Set Solver EZSMT (System Description)
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system ezsmt, one of the first...
متن کاملSystem Description: SMT-based Constraint Answer Set Solver EZSMT
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system EZSMT, one of the first...
متن کاملBeaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifierfree finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, encoding the original SMT problem into a Boolean satisfiability (SAT) problem using a series of word-level and bit-level transformations. In this paper, we describe the most effective transformations, such as propagating ...
متن کاملSMT-Solving for the Real Algebra
SAT-solving is a highly actual research area with increasing success and plenty of industrial applications. SMT-solving, extending SAT with theories, has its main focus on linear real constrains. However, there are only few solvers going further to more expressive but still decidable logics like the first-order theory of the reals with addition and multiplication. The main requests on theory so...
متن کاملSMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox - (Tool Presentation)
We present SMT-RAT, a C++ toolbox offering theory solver modules for the development of SMT solvers for nonlinear real arithmetic (NRA). NRA is an important but hard-to-solve theory and only fragments of it can be handled by some of the currently available SMT solvers. Our toolbox contains modules implementing the virtual substitution method, the cylindrical algebraic decomposition method, a Gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-10769-6_7